A column-generation based branch-and-bound algorithm for sorting by reversals
نویسندگان
چکیده
We consider the problem of sorting a permutation by reversals (SBR), calling for the minimum number of reversals transforming a given permutation of f1; : : : ; ng into the identity permutation. SBR was inspired by computational biology applications , in particular genome rearrangement. We propose an exact branch-and-bound algorithm for SBR. A lower bound is computed by solving a linear program with a possibly exponential (in n) number of variables, by using column generation techniques. An eeective branching scheme is described, which is combined with a greedy algorithm capable of producing near{optimal solutions. The algorithm presented can solve to optimality SBR instances of considerably larger size with respect to previous existing methods.
منابع مشابه
Sorting Permutations by Reversals Through Branch-and-Price
We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from evolutionary studies in molecular biology. Our approach is based on an integer linear programming formulation of a graph-theoretic relaxation of the problem, calling for a decomposition of the edge set of a bicolored graph into the maximum number of alternating cycles. Th...
متن کاملOptimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملFinding the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling
We identify the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling by sorting through various options that involve the primal simplex, dual simplex, and barrier methods for linear programming, the network simplex method for network ow problems, and DantzigWolfe decomposition and column generation. Note to Practitioners Min-sum scheduling problems ar...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملGenome Rearrangements and Sorting by Reversals
Sequence comparison in molecular biology is in the beginning of a major paradigm shift a shift from gene comparison based on local mutations to chromosome comparison based on global rearrangements. In the simplest f o r m the problem of gene rearrangements corresponds to sorting by reversals, i.e. sorting of an array using reversals of arbitrary fragments. Kececioglu and Sankoff gave the first ...
متن کامل